Canonical duality for unconditioned strong $d$-sequences
نویسندگان
چکیده
منابع مشابه
WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملweak and strong duality theorems for fuzzy conic optimization problems
the objective of this paper is to deal with the fuzzy conic program- ming problems. the aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. toward this end, the convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. un- der this setting, duality t...
متن کاملDuality for digital sequences
A duality theory for digital nets, i.e., for finite points sets with strong uniformity properties, was introduced by Niederreiter and Pirsic. This duality theory is based on the concept of the dual space M of a digital net. In this paper we extend the duality theory from (finite) digital nets to (infinite) digital sequences. The analogue of the dual space is now a chain of dual spaces (Mm)m≥1 f...
متن کاملDuality and Canonical Transformations
We present a brief review on the canonical transformation description of some duality symmetries in string and gauge theories. In particular, we consider abelian and non-abelian T-dualities in closed and open string theories as well as S-duality in abelian and non-abelian non-supersymmetric gauge theories. THU-96/36 hep-th/9610024 October 1996 Talk given at the Argonne Duality Institute, June 2...
متن کاملStrong Duality for Semidefinite Programming
It is well known that the duality theory for linear programming (LP) is powerful and elegant and lies behind algorithms such as simplex and interior-point methods. However, the standard Lagrangian for nonlinear programs requires constraint qualifications to avoid duality gaps. Semidefinite linear programming (SDP) is a generalization of LP where the nonnegativity constraints are replaced by a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyoto Journal of Mathematics
سال: 1986
ISSN: 2156-2261
DOI: 10.1215/kjm/1250520827